Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Hyperspectral unmixing based on sparse and orthogonal constrained non-negative matrix factorization
CHEN Shanxue, CHU Chengquan
Journal of Computer Applications    2019, 39 (8): 2276-2280.   DOI: 10.11772/j.issn.1001-9081.2019010105
Abstract604)      PDF (773KB)(309)       Save
Aiming at the problem that hyperspectral unmixing based on Non-negative Matrix Factorization (NMF) is easy to fall into local minimum and greatly affected by initial value, a linear unmixing algorithm based on Sparse and Orthogonal constrained Non-negative Matrix Factorization (SONMF) was proposed. Firstly, based on the traditional NMF hyperspectral linear unmixing method, the physical and chemical properties of the hyperspectral data was analyzed. Then the sparsity of the abundance and the independence of the endmember were combined together, two methods of Sparse Non-negative Matrix Factorization (SNMF) and Orthogonal Non-negative Matrix Factorization (ONMF) were combined and applied into hyperspectral unmixing. The experiments on simulation data and real data show that, compared with the three reference unmixing algorithms of Vertex Component Analysis (VCA), SNMF and ONMF, the proposed algorithm has improved the performance of linear unmixing, in which the Spectral Angle Distance (SAD) is reduced by 0.012 to 0.145. SONMF can combine the advantages of the two constraints to make up for the lack the expression of hyperspectral data by traditional NMF based linear unmixing methods, and achieve good results.
Reference | Related Articles | Metrics